Sequences with Subword Complexity 2n G Unter Rote Sequences with Subword Complexity 2n G Unter Rote
ثبت نشده
چکیده
Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innnite 0-1-sequences which contain 2n diierent sub-words of length n, for every n.
منابع مشابه
Sequences with Subword Complexity 2n G Unter Rote Sequences with Subword Complexity 2 N G Unter Rote
Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innite 0-1-sequences which contain 2n dierent sub-words of length n, for every n.
متن کاملThe subword complexity of atwo - parameter family of sequencesAviezri
We determine the subword complexity of the characteristic functions of a two-parameter family fA n g 1 n=1 of innnite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form A n = bnnc for all n 2 Z >0 , where is a xed positive irrational number. The characteristic functions of such sequences have been shown to have su...
متن کاملThe Subword Complexity of a Two-Parameter Family of Sequences
We determine the subword complexity of the characteristic functions of a twoparameter family {An}∞n=1 of infinite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form An = bnαc for all n ∈ Z>0, where α is a fixed positive irrational number. The characteristic functions of such sequences have been shown to have subwo...
متن کاملRelationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of length n is constant. In this paper we consider relational periods and relationally periodic sequences, where the relation is a similarity relation on words induced by a compatibility relation on letters. We investig...
متن کاملOn Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either Θ(n) for some k ∈ N, or is
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992